Reducing Huge Gyroscopic Eigenproblems by Automated Multi-level Substructuring
نویسندگان
چکیده
منابع مشابه
Reducing Huge Gyroscopic Eigenproblems by Automated Multi-level Substructuring
Abstract. Simulating numerically the sound radiation of a rolling tire requires the solution of a very large and sparse gyroscopic eigenvalue problem. Taking advantage of the automated multi– level substructuring (AMLS) method it can be projected to a much smaller gyroscopic problem, the solution of which however is still quite costly since the eigenmodes are non–real and complex arithmetic is ...
متن کاملAutomated Multi-Level Substructuring for nonlinear eigenproblems
In this paper we generalize the automated multi–level substructuring method to certain classes of nonlinear eigenvalue problems which can be partitioned into an essential linear and positive definite pencil and a small residual. The efficiency of the method is demonstrated by numerical examples modeling damped vibrations of a structure with nonproportional damping, a gyroscopic eigenproblem, an...
متن کاملOptimizing Noise and Vibration Performance Using Automated Multi-level Substructuring
The most costly part of the eeort for optimizing noise and vibration performance in automobiles is the computation of frequency response for very large nite element models. Until very recently, this task has only been feasible on vector supercomputers. The Automated Multi-Level Substructuring (AMLS) method has been developed to reduce the computational demands of frequency response analysis and...
متن کاملSolving an elliptic PDE eigenvalue problem via automated multi-level substructuring and hierarchical matrices
We propose a new method for the solution of discretised elliptic PDE eigen-value problems. The new method combines ideas of domain decomposition, as in the automated multi-level substructuring (short AMLS), with the concept of hierarchical matrices (short H-matrices) in order to obtain a solver that scales almost linearly (linear up to logarithmic factors) in the size of the discrete space. Whe...
متن کاملProjection Methods for Nonlinear Sparse Eigenvalue Problems
This paper surveys numerical methods for general sparse nonlinear eigenvalue problems with special emphasis on iterative projection methods like Jacobi–Davidson, Arnoldi or rational Krylov methods and the automated multi–level substructuring. We do not review the rich literature on polynomial eigenproblems which take advantage of a linearization of the problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archive of Applied Mechanics
سال: 2006
ISSN: 0939-1533,1432-0681
DOI: 10.1007/s00419-006-0013-0